On shortest cocycle covers of graphs
نویسندگان
چکیده
منابع مشابه
On covers of graphs by Cayley graphs
We prove that every vertex transitive, planar, 1-ended, graph covers every graph whose balls of radius r are isomorphic to the ball of radius r in G for a sufficiently large r. We ask whether this is a general property of finitely presented Cayley graphs, as well as further related questions.
متن کاملCycle-cocycle partitions and faithful cycle covers for locally finite graphs
By a result of Gallai, every finite graph G has a vertex partition into two parts each inducing an element of its cycle space. This fails for infinite graphs if, as usual, the cycle space is defined as the span of the edge sets of finite cycles in G. However we show that, for the adaptation of the cycle space to infinite graphs recently introduced by Diestel and Kühn (which involves infinite cy...
متن کاملCycle and cocycle coverings of graphs
In this article, we show that for any simple, bridgeless graph G on n vertices, there is a family C of at most n−1 cycles which cover the edges of G at least twice. A similar, dual result is also proven for cocycles namely: for any loopless graph G on n vertices and edges having cogirth g∗≥3 and k(G) components, there is a family of at most −n+k(G) cocycles which cover the edges of G at least t...
متن کاملOn 2-fold covers of graphs
A regular covering projection ℘: X̃ → X of connected graphs is G-admissible if G lifts along ℘. Denote by G̃ the lifted group, and let CT(℘) be the group of covering transformations. The projection is called G-split whenever the extension CT(℘) → G̃ → G splits. In this paper, split 2-covers are considered, with a particular emphasis given to cubic symmetric graphs. Supposing that G is transitive o...
متن کاملRandom Walks on Directed Covers of Graphs
Directed covers of finite graphs are also known as periodic trees or trees with finitely many cone types. We expand the existing theory of directed covers of finite graphs to those of infinite graphs. While the lower growth rate still equals the branching number, upper and lower growth rates do not longer coincide in general. Furthermore, the behaviour of random walks on directed covers of infi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1985
ISSN: 0095-8956
DOI: 10.1016/0095-8956(85)90045-0